Explicitly Broken Supersymmetry with Exactly Massless Moduli

There is an avatar of the little hierarchy problem of the MSSM in 3-dimensional supersymmetry. We propose a solution to this problem in AdS$_3$ based on the AdS/CFT correspondence. The bulk theory is a supergravity theory in which U(1) $\times$ U(1) R-symmetry is gauged by Chern-Simons fields. The bulk theory is deformed by a boundary term quadratic in the gauge fields. It breaks SUSY completely and sources an exactly marginal operator in the dual CFT. SUSY breaking is communicated by gauge interactions to bulk scalar fields and their spinor superpartners. Since the R-charges of scalar and spinor differ, this generates a SUSY breaking shift of their masses. The Ward identity facilitates the calculation of these mass shifts to any desired order in the strength of the deformation. Moduli fields are massless $R$-neutral bulk scalars with vanishing potential in the undeformed theory. These properties are maintained to all orders in the deformation despite the fact that moduli couple in the bulk to loops of R-charged fields.Comment: Match to published version. All order corrections, i.e. exact results after SUSY breaking, are show

Heuristic Algorithms to Minimize Total Weighted Tardiness on the Single Machine and Identical Parallel Machines with Sequence Dependent Setup and Future Ready Time

This study generates heuristic algorithms to minimize the total weighted tardiness on the single machine and identical parallel machines with sequence dependent setup and future ready time. Due to the complexity of the considered problem, we propose two new Apparent Tardiness Cost based (ATC-based) rules. The performances of these two rules are evaluated on the single machine and identical parallel machines. Besides of these two rules, we also propose a look-ahead identical parallel machines heuristic (LAIPM). When a machine becomes idle, it selects a job to process from available jobs and near future jobs. The proposed method, LAIPM, is evaluated with other look-ahead methods on the identical parallel machines